//https://www.nowcoder.com/questionTerminal/cd117803b3364b218a8b3dcc498dee25

#include <iostream>
using namespace std;
int main()
{
	int q;
	int a, b, c;
	cin >> q;
	while (q--)
	{
		cin >> a >> b >> c;
		int x = min(a, min(b, c));
		cout << (x * 2 + max(b - x - 1, 0)) << endl;
	}
	return 0;
}

//https://www.nowcoder.com/practice/54ab9865ce7a45968b126d6968a77f34?tpId=196&tqId=40529&ru=/exam/oj

class Solution
{
	int m, n;
	int dx[4] = { 0, 0, 1, -1 };
	int dy[4] = { 1, -1, 0, 0 };
	bool vis[1010][1010] = { 0 };
public:
	int rotApple(vector<vector<int> >& grid)
	{
		m = grid.size(), n = grid[0].size();
		queue<pair<int, int>> q;
		for (int i = 0; i < m; i++)
			for (int j = 0; j < n; j++)
				if (grid[i][j] == 2)
					q.push({ i, j });
		int ret = 0;
		while (q.size())
		{
			int sz = q.size();
			ret++;
			while (sz--)
			{
				auto [a, b] = q.front();
				q.pop();
				for (int i = 0; i < 4; i++)
				{
					int x = a + dx[i], y = b + dy[i];
					if (x >= 0 && x < m && y >= 0 && y < n && grid[x][y] == 1
						&& !vis[x][y])
					{
						vis[x][y] = true;
						q.push({ x, y });
					}
				}
			}
		}
		for (int i = 0; i < m; i++)
			for (int j = 0; j < n; j++)
				if (grid[i][j] == 1 && !vis[i][j])
					return -1;
		return ret - 1;
	}
};


//https://www.nowcoder.com/practice/f78a359491e64a50bce2d89cff857eb6?tpId=13&tqId=11199&ru=/exam/oj
class Solution
{
public:
	int LastRemaining_Solution(int n, int m)
	{
		int f = 0;
		for (int i = 2; i <= n; i++) f = (f + m) % i;
		return f;
	}
};